AEROFOILS OF MAXIMUM THICKNESS RATIO FOR A GIVEN MAXIMUM PRESSURE COEFFICIENT

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Maximum Correlation Coefficient∗

For an arbitrary random vector (X,Y ) and an independent random variable Z it is shown that the maximum correlation coefficient between X and Y + λZ as a function of λ is lower semicontinuous everywhere and continuous at zero where it attains its maximum. If, moreover, Z is in the class of self-decomposable random variables, then the maximal correlation coefficient is right continuous, nonincre...

متن کامل

The Maximum Number of Complete Subgraphs of Fixed Size in a Graph with Given Maximum Degree

In this paper, we make progress on a question related to one of Galvin that has attracted substantial attention recently. The question is that of determining among all graphs G with n vertices and ∆(G) ≤ r, which has the most complete subgraphs of size t, for t ≥ 3. The conjectured extremal graph is aKr+1 ∪Kb, where n = a(r + 1) + b with 0 ≤ b ≤ r. Gan, Loh, and Sudakov proved the conjecture wh...

متن کامل

A Reliability Coefficient for Maximum Likelihood Factor Analysis*

Maximum likelihood factor analysis provides an effective method for estimation of factor matrices and a useful test statistic in the likelihood ratio for rejection of overly simple factor models. A reliability coefficient is proposed to indicate quality of representation of interrelations among attributes in a battery by a maximum likelihood factor analysis. Usually, for a large sample of indiv...

متن کامل

The maximum number of complete subgraphs in a graph with given maximum degree

Extremal problems involving the enumeration of graph substructures have a long history in graph theory. For example, the number of independent sets in a d-regular graph on n vertices is at most (2 − 1) by the Kahn-Zhao theorem [7, 12]. Relaxing the regularity constraint to a minimum degree condition, Galvin [5] conjectured that, for n ≥ 2d, the number of independent sets in a graph with δ(G) ≥ ...

متن کامل

Maximum entropy copula with given diagonal section

Abstract. We consider copulas with a given diagonal section and compute the explicit density of the unique optimal copula which maximizes the entropy. In this sense, this copula is the least informative among the copulas with a given diagonal section. We give an explicit criterion on the diagonal section for the existence of the optimal copula and give a closed formula for its entropy. We also ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Quarterly Journal of Mechanics and Applied Mathematics

سال: 1948

ISSN: 0033-5614,1464-3855

DOI: 10.1093/qjmam/1.1.365